The Semantics of Entailment Omega

نویسندگان

  • Mariangiola Dezani-Ciancaglini
  • Robert K. Meyer
  • Yoko Motohama
چکیده

This paper discusses the relation between the minimal positive relevant logic B+ and intersection and union type theories. There is a marvellous coincidence between these very differently motivated research areas. First, we show a perfect fit between the Intersection Type Discipline ITD and the tweaking B ∧T of B+, which saves implication → and conjunction ∧ but drops disjunction ∨. The filter models of the λ-calculus (and its intimate partner Combinatory Logic CL) of the first author and her co-authors then become theory models of these calculi. (The logician’s Theory is the algebraist’s Filter.) The coincidence extends to a dual interpretation of key particles – the subtype≤ translates to provable →, type intersection ∩ to conjunction ∧, function space → to implication and whole domainω to the (trivially added but trivial) truth T. This satisfying ointment contains a fly. For it is right, proper and to be expected that type union ∪ should correspond to the logical disjunction ∨ of B+. But the simulation of functional application by a fusion (or modus ponens product) operation ◦ on theories leaves the key Bubbling lemma of work on ITD unprovable for the ∨-prime theories now appropriate for the modelling. The focus of the present paper lies in an appeal to Harrop theories which are (a) prime and (b) closed under fusion. A version of the Bubbling lemma is then proved for Harrop theories, which accordingly furnish a model of λ and CL.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Role of Semantics in Recognizing Textual Entailment

Systems designed to recognize textual entailment typically employ both syntax and semantics. Our goal in this paper is to explore the degree to which semantics alone can be used to accurately detect entailment so that we can gain a better understanding of this single component within an entailment system. This paper reports the knowledge-bases considered and selected for person names, locations...

متن کامل

Using Minimal Recursion Semantics for Entailment Recognition

This paper describes work on using Minimal Recursion Semantics (MRS) representations for the task of recognising textual entailment. I use entailment data from a SemEval-2010 shared task to develop and evaluate an entailment recognition heuristic. I compare my results to the shared task winner, and discuss differences in approaches. Finally, I run my system with multiple MRS representations per...

متن کامل

Entailment above the word level in distributional semantics

We introduce two ways to detect entailment using distributional semantic representations of phrases. Our first experiment shows that the entailment relation between adjective-noun constructions and their head nouns (big cat |= cat), once represented as semantic vector pairs, generalizes to lexical entailment among nouns (dog |= animal). Our second experiment shows that a classifier fed semantic...

متن کامل

Graded Entailment for Compositional Distributional Semantics

The categorical compositional distributional model of natural language provides a conceptually motivated procedure to compute the meaning of sentences, given grammatical structure and the meanings of its words. This approach has outperformed other models in mainstream empirical language processing tasks. However, until now it has lacked the crucial feature of lexical entailment – as do other di...

متن کامل

A Vector Space for Distributional Semantics for Entailment

Distributional semantics creates vectorspace representations that capture many forms of semantic similarity, but their relation to semantic entailment has been less clear. We propose a vector-space model which provides a formal foundation for a distributional semantics of entailment. Using a mean-field approximation, we develop approximate inference procedures and entailment operators over vect...

متن کامل

Distributional semantic models for detection of textual entailment

We present our experiments on integrating and evaluating distributional semantics with the recognising textual entailment task (RTE). We consider entailment as semantic similarity between text and hypothesis coupled with additional heuristic, which can be either selecting the top scoring hypothesis or a pre-defined threshold. We show that a distributional model is particularly good at detecting...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Notre Dame Journal of Formal Logic

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2002